new graph products for configuration processing

نویسندگان

a. kaveh iust

s. beheshti iust

چکیده

for the analysis of structures, the first step consists of configuration processing followed by data generation. this step is the most time consuming part of the analysis for large-scale structures. in this paper new graph products called triangular and circular graph products are developed for the formation of the space structures. the graph products are extensively used in graph theory and combinatorial optimization, however, the triangular and circular products defined in this paper are more suitable for the formation of practical space structural models which can not be generated easily by the previous products. the new products are employed for the configuration processing of space structures that are of triangular or a combination of triangular and rectangular shapes, and also in circular shapes as domes and some other space structural models. cut out products are other new types of graph products which are defined to eliminate all of the connected elements to the considered node to configure the model or grid with some vacant panels inside of the model. the application of the presented graph products can be extended to the formation of finite element models.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A new approach in graph- based integrated production and distribution scheduling for perishable products

This study is concerned with how the quality of perishable products can be improved by shortening the time interval between production and distribution. As special types of food such as dairy products decay fast, the integration of production and distribution scheduling (IPDS) is investigated. An integrated scheduling of both processes improves the performance and costs because the separated sc...

متن کامل

Multi-dimensional Graph Configuration for Natural Language Processing

Many tasks in computational linguistics can be regarded as configuration problems. In this paper, we introduce the notion of lexicalised multi-dimensional configuration problems (lmcps). This class of problems both has a wide range of linguistic applications, and can be solved in a straightforward way using state-of-the-art constraint programming technology. The paper falls into two main parts:...

متن کامل

Optimizing the Supply Chain Configuration for New Products

We address how to configure the supply chain for a new product whose design has already been decided. The central question is to determine what suppliers, parts, processes and transportation modes to select at each stage in the supply chain. There might be multiple options to supply a raw material, to manufacture or assemble the product, and to transport the product to the customer. Each of the...

متن کامل

Optimizing the order processing of customized products using product configuration

For the better part of the 20 th century many large companies have been focussed on optimizing their mass production process as a way of maximizing their profits. Nowadays, in the existing environment of global competitiveness, enhancing the production process remains a significant issue as well. Product configuration based on integrated modular product structure and product family architecture...

متن کامل

Graph homology and graph configuration spaces

If R is a commutative ring, M a compact R-oriented manifold and G a finite graph without loops or multiple edges, we consider the graph configuration space MG and a Bendersky–Gitler type spectral sequence converging to the homology H∗(M, R). We show that its E1 term is given by the graph cohomology complex CA(G) of the graded commutative algebra A = H∗(M, R) and its higher differentials are obt...

متن کامل

Configuration Spaces and Polyhedral Products

This paper aims to find the most general combinatorial conditions under which a moment-angle complex (D2, S1)K is a co-H-space, thus splitting unstably in terms of its full subcomplexes. Our main tool is a certain generalization of the theory of labelled configuration spaces.

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید


عنوان ژورنال:
international journal of civil engineering

جلد ۱۱، شماره ۲، صفحات ۶۷-۷۶

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023